Systolic trellis automata: Stability, decidability and complexity
نویسندگان
چکیده
منابع مشابه
Decidability and Complexity Results for Timed Automata via Channel Machines
This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dill [5] showed that the language inclusion problem is decidable if A has no clocks and undecidable if A has two clocks (with no restriction on B). However, the status of the problem when A has one clock is not determined by [5]. ...
متن کاملDecidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
We define a new class of hybrid automata for which reachability is decidable—a proper superclass of the initialized rectangular hybrid automata—by taking parallel compositions of simple components. Attempting to generalize, we encounter timed automata with algebraic constants. We show that reachability is undecidable for these algebraic timed automata by simulating two-counter Minsky machines. ...
متن کاملStability and Complexity of Minimising Probabilistic Automata
We consider the state-minimisation problem for weighted and probabilistic automata. We provide a numerically stable polynomialtime minimisation algorithm for weighted automata, with guaranteed bounds on the numerical error when run with floating-point arithmetic. Our algorithm can also be used for “lossy” minimisation with bounded error. We show an application in image compression. In the secon...
متن کاملDecidability, Introduction Rules and Automata
We present a method to prove the decidability of provability in several well-known inference systems. This method generalizes both cut-elimination and the construction of an automaton recognizing the provable propositions.
متن کاملComplexity, decidability and completeness
We give resource bounded versions of the Completeness Theorem for propositional and predicate logic. For example, it is well known that every computable consistent propositional theory has a computable complete consistent extension. We show that, when length is measured relative to the binary representation of natural numbers and formulas, every polynomial time decidable propositional theory ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1986
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(86)80011-0